Reduction of Elliptic Curves in Equal Characteristic 3 (and 2)
نویسندگان
چکیده
منابع مشابه
On elliptic curves in characteristic 2 with wild additive reduction
Introduction. In [Ge1] Gekeler classified all elliptic curves over F2r (T ) with one rational place of multiplicative reduction (without loss of generality located at ∞), one further rational place of bad reduction (without loss of generality located at 0) and good reduction elsewhere. So these curves have conductor ∞ · T where n is a natural number (which actually can be arbitrarily large). In...
متن کاملsynthesis of 3-aryl-2h-benzo[b]-1,4-oxazines in [omim]bf4 and reduction of organic compounds in methylimidazolium formate
در این پروژه ترکیبات 3-آریل-2h-بنزو[b]-4،1-اکسازین ها از مواد اولیه تجاری مشتقات دو آمینو فنول و ?-هالو کتون های آروماتیک در مایع یونی 1-اکتیل-3-متیل ایمیدازولیوم تترا فلورو بورات([omim]bf4) سنتز شده است. این واکنش توسط باز پتاسیم کربنات محلول از طریق o-آلکیلاسیون و سپس یک واکنش آمیداسیون درون مولکولی خود بخود در مدت زمان کوتاه انجام می شود. ترکیبات 4،1-بنزوکسازین به این روش با بهره خوب تا آلی ...
15 صفحه اولFast hashing onto elliptic curves over fields of characteristic 3
We describe a fast hash algorithm that maps arbitrary messages onto points of an elliptic curve defined over a finite field of characteristic 3. Our new scheme runs in time O(m) for curves over F3m . The best previous algorithm for this task runs in time O(m). Experimental data confirms the speedup by a factor O(m), or approximately a hundred times for practical m values. Our results apply for ...
متن کاملEfficient Arithmetic on Elliptic Curves in Characteristic 2
We present normal forms for elliptic curves over a field of characteristic 2 analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient algorithms for point addition and scalar multiplication on these forms. The resulting algorithms apply to any elliptic curve over a field of characteristic 2 with a ...
متن کاملPoint Multiplication on Supersingular Elliptic Curves Defined over Fields of Characteristic 2 and 3
Elliptic curve cryptosystem protocols use two main operations, the scalar multiplication and the pairing computation. Both of them are done through a chain of basic operation on the curve. In this paper we present new formulas for supersingular elliptic curve in characteristic 2 and 3. We improve best known formulas by at least one multiplication in the field.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 2005
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-2005-040-2